1,035 research outputs found
Super-spreading Events and Contribution to Transmission of MERS, SARS, and COVID-19
There is no clear definition for the term ‘super-spreader’ or ‘super-spreading event’. The World Health Organization refers to a super-spreader as a patient (or an event) that may transmit infection to a larger number of individuals than is usual by one individual (or event). In the severe acute respiratory syndrome (SARS) situation, a super-spreading event was defined as the transmission of SARS to at ≥8 contacts, and other authors defined this as individuals infecting an unusually large number of secondary cases [ 1 , 2 ]. A super-spreading event could merely be defined as an event in which one patient infects far more people than an average patient does, which is estimated by the basic reproduction number (R0)
A Denotational Semantics for First-Order Logic
In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational
interpretation of first-order formulas over arbitrary interpretations. Here we
complement this work by introducing a denotational semantics for first-order
logic. Additionally, by allowing an assignment of a non-ground term to a
variable we introduce in this framework logical variables.
The semantics combines a number of well-known ideas from the areas of
semantics of imperative programming languages and logic programming. In the
resulting computational view conjunction corresponds to sequential composition,
disjunction to ``don't know'' nondeterminism, existential quantification to
declaration of a local variable, and negation to the ``negation as finite
failure'' rule. The soundness result shows correctness of the semantics with
respect to the notion of truth. The proof resembles in some aspects the proof
of the soundness of the SLDNF-resolution.Comment: 17 pages. Invited talk at the Computational Logic Conference (CL
2000). To appear in Springer-Verlag Lecture Notes in Computer Scienc
The Stress Distribution on the Zygapophyseal Joint of Lumbar Vertebra by ANSYS Program
Zygapophyseal joints (or facet joints), are a plane synovial joint which located between the articular facet processes of the vertebral arch which is freely guided movable joints. Ten dried vertebrae were used for the lumbar region and taking (L4) as a sample to reveal stress pathways across the joints by using ANSYS program under different loading conditions which used Finite Elements Analysis model. Results obtained from the ANSYS program are important in understanding the boundary conditions for load analysis and the points of stress concentration which explained from the anatomical point of view and linked to muscle and ligament attachments. This model used as a computational tool to joint biomechanics and to prosthetic implant analysis
A discrete inhomogeneous model for the yeast cell cycle
We study the robustness and stability of the yeast cell regulatory network by
using a general inhomogeneous discrete model. We find that inhomogeneity, on
average, enhances the stability of the biggest attractor of the dynamics and
that the large size of the basin of attraction is robust against changes in the
parameters of inhomogeneity. We find that the most frequent orbit, which
represents the cell-cycle pathway, has a better biological meaning than the one
exhibited by the homogeneous model.Comment: 5 pages, 1 figur
Independence in CLP Languages
Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and
prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two
additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent
backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution
A Framework to Synergize Partial Order Reduction with State Interpolation
We address the problem of reasoning about interleavings in safety
verification of concurrent programs. In the literature, there are two prominent
techniques for pruning the search space. First, there are well-investigated
trace-based methods, collectively known as "Partial Order Reduction (POR)",
which operate by weakening the concept of a trace by abstracting the total
order of its transitions into a partial order. Second, there is state-based
interpolation where a collection of formulas can be generalized by taking into
account the property to be verified. Our main contribution is a framework that
synergistically combines POR with state interpolation so that the sum is more
than its parts
The Lambek calculus with iteration: two variants
Formulae of the Lambek calculus are constructed using three binary
connectives, multiplication and two divisions. We extend it using a unary
connective, positive Kleene iteration. For this new operation, following its
natural interpretation, we present two lines of calculi. The first one is a
fragment of infinitary action logic and includes an omega-rule for introducing
iteration to the antecedent. We also consider a version with infinite (but
finitely branching) derivations and prove equivalence of these two versions. In
Kleene algebras, this line of calculi corresponds to the *-continuous case. For
the second line, we restrict our infinite derivations to cyclic (regular) ones.
We show that this system is equivalent to a variant of action logic that
corresponds to general residuated Kleene algebras, not necessarily
*-continuous. Finally, we show that, in contrast with the case without division
operations (considered by Kozen), the first system is strictly stronger than
the second one. To prove this, we use a complexity argument. Namely, we show,
using methods of Buszkowski and Palka, that the first system is -hard,
and therefore is not recursively enumerable and cannot be described by a
calculus with finite derivations
- …